An Efficient Constructive Heuristic for the Cutting Stock Problem Applied in a Foam Mattress Industry

نویسندگان

چکیده

The cutting and packing problem belongs to the combinatorial optimization problems; it covers a wide range of practical cases in industries. present paper investigates new real world needs be solved through daily operations foam blocks an industrial company. is considered as one non-classical problems area. It represents variant three dimensional Cutting Stock Problem. originality studied indicated by specific set constraints related production process ways. A constructive heuristic was developed provide patterns advance. All possible combinations established from ways right rectangular prisms define patterns. This performs well shows promising results reasonable computational times efficient plans order reduce total material loss.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Progressive Heuristic Search Algorithm for the Cutting Stock Problem

This paper presents a new variant of the A class algorithms for solving the known one dimensional cutting stock problem in a card board factory where the objective is to minimise the useless remaining of a continuous cardboard surface The algorithm limits the number of nodes in the tree search by using a bound criterion based on the prob lem restrictions The process of computing the solution is...

متن کامل

A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

This paper presents a new best-fit heuristic for the two-dimensional rectangular stock-cutting problem and demonstrates its effectiveness by comparing it against other published approaches. A placement algorithm usually takes a list of shapes, sorted by some property such as increasing height or decreasing area, and then applies a placement rule to each of these shapes in turn. The proposed met...

متن کامل

Extended Haessler Heuristic Algorithm for Cutting Stock Problem: a Case Study in Film Industry

The cutting stock problem is an important problem in the field of combinational optimization. In classic versions of this problem, the aim is to find a solution for cutting some equalwidth mother rolls into smaller parts with given width so that the amount of trim-loss become as small as possible. There are plenty of works which addressed the classic cutting stock problem. However in real world...

متن کامل

An ACO algorithm for one-dimensional cutting stock problem

The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...

متن کامل

A Heuristic Particle Swarm Optimization for Cutting Stock Problem Based on Cutting Pattern

A heuristic particle swarm optimization (HPSO) is proposed as a solution to one-dimensional cutting stock problem (1D-CSP), which incorporate genetic operators into particle swarm optimization (PSO). In this paper, a heuristic strategy that is based on the results of analysis of the optimal cutting pattern of particles with successful search processes is described, which process a global optimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Applied Metaheuristic Computing

سال: 2022

ISSN: ['1947-8291', '1947-8283']

DOI: https://doi.org/10.4018/ijamc.298317